The complexity of a two - parameter familyof sequencesAviezri
نویسندگان
چکیده
We determine the complexity of the characteristic functions of a two-parameter family fA n g 1 n=1 of innnite sequences which are associated with the winning strategies for a family of 2-player games. A special case of the family has the form A n = bnnc for all n 2 Z + , where is a xed positive irrational number. The characteristic functions of such sequences have been shown to have complexity n + 1. We show that every sequence in the extended family has complexity linear in n.
منابع مشابه
The subword complexity of atwo - parameter family of sequencesAviezri
We determine the subword complexity of the characteristic functions of a two-parameter family fA n g 1 n=1 of innnite sequences which are associated with the winning strategies for a family of 2-player games. A special case of the family has the form A n = bnnc for all n 2 Z >0 , where is a xed positive irrational number. The characteristic functions of such sequences have been shown to have su...
متن کاملA Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملDYNAMIC COMPLEXITY OF A THREE SPECIES COMPETITIVE FOOD CHAIN MODEL WITH INTER AND INTRA SPECIFIC COMPETITIONS
The present article deals with the inter specific competition and intra-specific competition among predator populations of a prey-dependent three component food chain model consisting of two competitive predator sharing one prey species as their food. The behaviour of the system near the biologically feasible equilibria is thoroughly analyzed. Boundedness and dissipativeness of the system are e...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملA Signal Processing Approach to Estimate Underwater Network Cardinalities with Lower Complexity
An inspection of signal processing approach in order to estimate underwater network cardinalities is conducted in this research. A matter of key prominence for underwater network is its cardinality estimation as the number of active cardinalities varies several times due to numerous natural and artificial reasons due to harsh underwater circumstances. So, a proper estimation technique is mandat...
متن کامل